Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/HofWaldSLASH7.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(f₂(f₂(f₂(j, a), b), c), d) -> f₂(f₂(a, b), f₂(f₂(a, d), c))

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(f₂(f₂(f₂(j, a), b), c), d) -> f₂(f₂(a, b), f₂(f₂(a, d), c))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(f₂(f₂(f₂(j, a), b), c), d) -> f₂(f₂(a, b), f₂(f₂(a, d), c))

The set Q consists of the following terms:

f₂(f₂(f₂(f₂(j, x0), x1), x2), x3)

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(a, d)
F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(f₂(a, b), f₂(f₂(a, d), c))
F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(f₂(a, d), c)
F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(a, b)

The TRS R consists of the following rules:

f₂(f₂(f₂(f₂(j, a), b), c), d) -> f₂(f₂(a, b), f₂(f₂(a, d), c))

The set Q consists of the following terms:

f₂(f₂(f₂(f₂(j, x0), x1), x2), x3)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(a, d)
F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(f₂(a, b), f₂(f₂(a, d), c))
F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(f₂(a, d), c)
F₂(f₂(f₂(f₂(j, a), b), c), d) -> F₂(a, b)

The TRS R consists of the following rules:

f₂(f₂(f₂(f₂(j, a), b), c), d) -> f₂(f₂(a, b), f₂(f₂(a, d), c))

The set Q consists of the following terms:

f₂(f₂(f₂(f₂(j, x0), x1), x2), x3)

We have to consider all minimal (P,Q,R)-chains.